A new tool for proving Vizing's Theorem
نویسنده
چکیده
The known proofs of the famous theorem of Vizing on edge coloring of (multi)graphs are not long but sophisticated. The main goal of this note is to present an auxiliary (multi)digraph that simplifies and facilitates proofs of it. The secondary goal is to use the approach for proofs of Vizing’s Adjacency Lemma and the Andersen-Goldberg Theorem. Mathematics Subject Classification: 05C15, 05C35, 05C70
منابع مشابه
A fixed point method for proving the stability of ring $(alpha, beta, gamma)$-derivations in $2$-Banach algebras
In this paper, we first present the new concept of $2$-normed algebra. We investigate the structure of this algebra and give some examples. Then we apply a fixed point theorem to prove the stability and hyperstability of $(alpha, beta, gamma)$-derivations in $2$-Banach algebras.
متن کاملA New Common Fixed Point Theorem for Suzuki Type Contractions via Generalized $Psi$-simulation Functions
In this paper, a new stratification of mappings, which is called $Psi$-simulation functions, is introduced to enhance the study of the Suzuki type weak-contractions. Some well-known results in weak-contractions fixed point theory are generalized by our researches. The methods have been appeared in proving the main results are new and different from the usual methods. Some suitable examples ar...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملConstruction of measures of noncompactness of $C^k(Omega)$ and $C^k_0$ and their application to functional integral-differential equations
In this paper, first, we investigate the construction of compact sets of $ C^k$ and $ C_0^k$ by proving ``$C^k, C_0^k-version$" of Arzel`{a}-Ascoli theorem, and then introduce new measures of noncompactness on these spaces. Finally, as an application, we study the existence of entire solutions for a class of the functional integral-differential equations by using Darbo's fixe...
متن کاملOn Edge-Colouring Indifference Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suucient condition for 0 (G) = (G) + 1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 326 شماره
صفحات -
تاریخ انتشار 2014